Enabling Distributed Knowledge Management: Managerial and Technological Implications

In this paper we show that the typical architecture of current KM systems re.ects an objectivistic epistemology and a traditional managerial control paradigm. We argue that such an objectivistic epistemology is inconsistent with many theories on the nature of knowledge, in which subjectivity and sociality are taken as essential features of knowledge creation and sharing. We show that adopting such a new epistemological view has dramatic consequences at an architectural, managerial and technological level

ТЕОРЕТИЧНА ІНТЕГРАЦІЯ ВЕБ-СЕРВІСІВ ВИЯВЛЕННЯ І КОМПОЗИЦІЇ / D2.4.6. A THEORETICAL INTEGRATION OF WEB SERVICE DISCOVERY AND COMPOSITION (ПЕРЕКЛАД РЕМАРОВИЧ С.)

У даному документі розглядається проблема забезпечення комплексного підходу до автоматичного виявлення і композиції доступних семантичних Веб-сервісів для того, щоб виконати даний запит користувача, вказаний в якості мети композиції.\ud \ud In this document we propose a possible theoretical approach for combining service discovery, functional-level service\ud composition, and process-level service composition. We analyse the challanges in composition of these functionalities (integration of Web service discovery and composition) and propose a theoretical way to solve them.\ud Keyword list: semantic Web service discovery, functional level composition of Web service, process level composition of web service, integration of web service discovery and compositio

Unravelling the Impact of Temporal and Geographical Locality in Content Caching Systems

To assess the performance of caching systems, the definition of a proper process describing the content requests generated by users is required. Starting from the analysis of traces of YouTube video requests collected inside operational networks, we identify the characteristics of real traffic that need to be represented and those that instead can be safely neglected. Based on our observations, we introduce a simple, parsimonious traffic model, named Shot Noise Model (SNM), that allows us to capture temporal and geographical locality of content popularity. The SNM is sufficiently simple to be effectively employed in both analytical and scalable simulative studies of caching systems. We demonstrate this by analytically characterizing the performance of the LRU caching policy under the SNM, for both a single cache and a network of caches. With respect to the standard Independent Reference Model (IRM), some paradigmatic shifts, concerning the impact of various traffic characteristics on cache performance, clearly emerge from our results.Comment: 14 pages, 11 Figures, 2 Appendice

Temporal Locality in Today's Content Caching: Why it Matters and How to Model it

The dimensioning of caching systems represents a difficult task in the design of infrastructures for content distribution in the current Internet. This paper addresses the problem of defining a realistic arrival process for the content requests generated by users, due its critical importance for both analytical and simulative evaluations of the performance of caching systems. First, with the aid of YouTube traces collected inside operational residential networks, we identify the characteristics of real traffic that need to be considered or can be safely neglected in order to accurately predict the performance of a cache. Second, we propose a new parsimonious traffic model, named the Shot Noise Model (SNM), that enables users to natively capture the dynamics of content popularity, whilst still being sufficiently simple to be employed effectively for both analytical and scalable simulative studies of caching systems. Finally, our results show that the SNM presents a much better solution to account for the temporal locality observed in real traffic compared to existing approaches.Comment: 7 pages, 7 figures, Accepted for publication in ACM Computer Communication Revie

МІНІМАЛІСТИЧНИЙ ПІДХІД ДО СЕМАНТИЧНИХ АНОТАЦІЙ ДЛЯ КОМПОЗИЦІЙ ВЕБ-ПРОЦЕСІВ. ПЕРЕКЛАД СТАТТІ «A MINIMALIST APPROACH TO SEMANTIC ANNOTATIONS FORWEB PROCESSES COMPOSITIONS» (ПЕРЕКЛАД РЕМАРОВИЧ С.)

Семантичні описи Веб-сервісів відкривають шлях до автоматизації їх композиції. Проте, поточні підходи до автоматизованої композиції, які використовують семантику,\ud незважаючи на їх виразну силу, являються важкими у використанні на практиці. Вони вимагають дійсно всеохоплюючих і, зазвичай, великих онтологічних описів процесів, а також досить складних (і часто неефективних) механізмів міркувань. У цій роботі пропонується мінімалістський підхід до семантичної анотації Веб-сервісів,\ud описаних як процеси, такий, що ми можемо виконати обмежене, але ефективне і корисне семантичне міркування для композиції Веб-сервісів на рівні процесу

Interactive Planning for Space Applications

No abstract availabl

AUTOMATED COMPOSITION OF WEB SERVICES VIA PLANNING IN ASYNCHRONOUS DOMAINS\ud

The service-oriented paradigm promises a novel degree of interoperability between\ud business processes, and is leading to a major shift in way distributed applications are\ud designed and realized. While novel and more powerful services can be obtained, in such\ud setting, by suitably orchestrating existing ones, manually developing such orchestrations\ud is highly demanding, time-consuming and error-prone. Providing automated service\ud composition tools is therefore essential to reduce the time to market of services, and\ud ultimately to successfully enact the service-oriented approach.\ud In this paper, we show that such tools can be realized based on the adoption and extension\ud of powerful AI planning techniques, taking the “planning via model-checking” approach\ud as a stepping stone. In this respect, this paper summarizes and substantially extends a\ud research line that started early in this decade and has continued till now. Specifically, this\ud work provides three key contributions.\ud First, we describe a novel planning framework for the automated composition of Web\ud services, which can handle services specified and implemented using industrial standard\ud languages for business processes modeling and execution, like ws-bpel. Since these\ud languages describe stateful Web services that rely on asynchronous communication\ud primitives, a distinctive aspect of the presented framework is its ability to model and\ud solve planning problems for asynchronous domains.\ud Second, we formally spell out the theory underlying the framework, and provide algorithms\ud to solve service composition in such framework, proving their correctness and\ud completeness. The presented algorithms significantly extend state-of-the-art techniques\ud for planning under uncertainty, by allowing the combination of asynchronous domains\ud according to behavioral requirements.\ud Third, we provide and discuss an implementation of the approach, and report extensive\ud experimental results which demonstrate its ability to scale up to significant cases for\ud which the manual development of ws-bpel composed services is far from trivial and time\ud consuming